منابع مشابه
Optimization of Clifford Circuits
We study optimal synthesis of Clifford circuits, and apply the results to peep-hole optimization of quantum circuits. We report optimal circuits for all Clifford operations with up to four inputs. We perform peep-hole optimization of Clifford circuits with up to 40 inputs found in the literature, and demonstrate the reduction in the number of gates by about 50%. We extend our methods to the opt...
متن کاملSynthesis of unitaries with Clifford+T circuits
Implementing a unitary operation using a universal gate set is a fundamental problem in quantum computing. The problem naturally arises when we want to implement some quantum algorithm on a fault tolerant quantum computer. Most fault tolerant protocols allow one to implement only Clifford circuits (those generated by CNOT, Hadamard and Phase gates). To achieve universal quantum computation one ...
متن کاملClassical simulation complexity of extended Clifford circuits
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inp...
متن کاملMapping NCV Circuits to Optimized Clifford+T Circuits
The need to consider fault tolerance in quantum circuits has led to recent work on the optimization of circuits composed of Clifford+T gates. The primary optimization objectives are to minimize the T -count (number of T gates) and the T -depth (the number of groupings of parallel T gates). These objectives arise due to the high cost of the fault tolerant implementation of the T gate compared to...
متن کاملQuantum Advantage from Conjugated Clifford Circuits
A well-known result of Gottesman and Knill [Got99] states that Clifford circuits – i.e. circuits composed of only CNOT, Hadamard, and π/4 phase gates – are efficiently classically simulable. We show that in contrast, “conjugated Clifford circuits” (CCCs) – where one additionally conjugates every qubit by the same one-qubit gate U – can perform hard sampling tasks. In particular, we fully classi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2013
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.88.052307